Obtaining smooth mesh transitions using vertex optimization
نویسندگان
چکیده
Mesh optimization has proven to be an effective way to improve mesh quality for arbitrary Lagrangian Eulerian (ALE) simulations. To date, however, most of the focus has been on improving the geometric shape of individual elements, and these methods often do not result in smooth transitions in element size or aspect ratio across groups of elements. We present an extension to the mean ratio optimization that addresses this problem and yields smooth transitions within regions and across regions in the ALE simulation. While this method is presented in the context of ALE simulations, it is applicable to a wider set of applications that require mesh improvement, including the mesh generation process. Published in 2007 by John Wiley & Sons, Ltd.
منابع مشابه
A framework for memory-efficient levels of detail
We introduce a representation, called a Multi-Level Progressive Mesh, for managing Levels of Detail (LODs) of a triangular mesh, allowing to store in memory an arbitrary number of LODs, with only about a 10 % increase in memory usage with respect to the highest resolution mesh. We assume that LODs were generated by a previous process, and concentrate on representing them efficiently, allowing p...
متن کاملQuality Improvement of Surface Triangulations Us- ing Local Parameterization
A pro edure has been developed for improvement of surfa e triangulation quality by node repositioning as dire ted by a two-stage non-linear optimization te hnique. The surfa e mesh modi ation pro edure is designed so that the quality of the triangles is improved without drasti ally distorting the surfa e. Repositioning of the nodes is done using lo al parametri mapping so that they remain on th...
متن کاملSurface Construction with Near Least Square Acceleration based on Vertex Normals on Triangular Meshes
Shading makes faceted objects appear smooth. However, the contour will still appear non smooth. Subdivision schemes can handle this problem by introducing new polygons in the mesh. The disadvantage is that a more complex mesh takes more time to render than a simple one. We propose a new method for constructing a curvilinear mesh using quadratic curves with near least square acceleration. This m...
متن کاملSurface Mesh Smoothing, Regularization, and Feature Detection
We describe a hybrid algorithm that is designed to reconstruct a piecewise smooth surface mesh from noisy input. While denoising, our method simultaneously regularizes triangle meshes on flat regions for further mesh processing and preserves crease sharpness for faithful reconstruction. A clustering technique, which combines K-means and geometric a priori information, is first developed and ref...
متن کاملFluid Surface Reconstruction from Particles
Outlined is a new approach to the problem of surfacing particle-based fluid simulations. The key idea is to construct a surface that is as smooth as possible while remaining faithful to the particle locations. We describe a mesh-based algorithm that expresses the surface in terms of a constrained optimization problem. Our algorithm incorporates a secondary contribution in Marching Tiles, a gene...
متن کامل